On the Algebraic Structure of Linear Trellises
نویسندگان
چکیده
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In this paper we first develop a new algebraic framework for a systematic analysis of linear trellises which enables us to address open foundational questions. In particular, we present a useful and powerful characterization of linear trellis isomorphy. We also obtain a new proof of the Factorization Theorem of Koetter/Vardy and point out unnoticed problems for the group case. Next, we apply our work to: describe all the elementary trellis factorizations of linear trellises and consequently to determine all the minimal linear trellises for a given code; prove that nonmergeable one-to-one linear trellises are strikingly determined by the edge-label sequences of certain closed paths; prove self-duality theorems for minimal linear trellises; analyze quasi-cyclic linear trellises and consequently extend results on reduced linear trellises to nonreduced ones. To achieve this, we also provide new insight into mergeability and path connectivity properties of linear trellises. Our classification results are important for iterative decoding as we show that minimal linear trellises can yield different pseudocodewords even if they have the same graph structure. Index Terms – Linear tail-biting trellises, linear block codes, nonmergeable trellises, minimal trellises.
منابع مشابه
Unifying Views of Tail-Biting Trellises for Linear Block Codes
This thesis presents new techniques for the construction and specification of linear tail-biting trellises. Tail-biting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis descriptions. Conventional trellises for block codes have a well understood underlying theory. On the other...
متن کاملAlgebraic Construction of Tail-Biting Trellises for Linear Block Codes
In this paper, we present an algebraic construction of tail-biting trellises. The proposed method is based on the state space expressions, i.e., the state space is the image of the set of information sequences under the associated state matrix. Then combining with the homomorphism theorem, an algebraic trellis construction is obtained. We show that a tailbiting trellis constructed based on the ...
متن کاملOn the Trellis Structure of Block Codes - Information Theory, IEEE Transactions on
Abst+act-The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that 1) the minimal trellis for a nonlinear code may not be observable, i.e., some codewords may be represented by more than one path through the trellis and 2) minimizing the vertex count at one time index may be inc...
متن کاملThe structure of tail-biting trellises: minimality and basic principl
Basic structural properties of tail-biting trellises are investigated. We start with rigorous definitions of various types of minimality for tail-biting trellises. We then show that biproper and/or nonmergeable tail-biting trellises are not necessarily minimal, even though every minimal tail-biting trellis is biproper. Next, we introduce the notion of linear (or group) trellises and prove, by e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1402.6404 شماره
صفحات -
تاریخ انتشار 2014